A New Model for Automatic Generation of Plan Libraries for Plan Recognition

نویسندگان

  • Martín G. Marchetta
  • Raymundo Q. Forradellas
چکیده

The problem of generating plan libraries for plan recognition (the inverse of the planning problem), has gained much importance in recent years, because of the dependence of the existing plan recognition techniques on them, and the difficulty of the problem. Even when there is considerable work related to the plan recognition process itself, less work has been done on the generation of such plan libraries. In this paper, we present some preliminary ideas for a new approach for acquiring hierarchical plan libraries automatically, based only on a few simple assumptions and with little given knowledge.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Supporting Interleaved Plans in Learning Hierarchical Plan Libraries for Plan Recognition

Most of the available plan recognition techniques are based on the use of a plan library in order to infer user’s intentions and/or strategies. Until some years ago, plan libraries were completely hand coded by human experts, which is an expensive, error prone and slow process. Besides, plan recognition systems with hand-coded plan libraries are not easily portable to new domains, and the creat...

متن کامل

Generation of Alternative Decompositions for Plan Libraries

Plan libraries are the most important knowledge source of many plan recognition systems. The plan decompositions they contain provide information about how a plan has to be executed to actually achieve its associated goals and be recognized by the system. This paper presents an approach to the automatic acquisition of plan decompositions from sample action sequences. In particular a clustering ...

متن کامل

Plan Libraries for Plan Recognition: Do We Really Know What They Model?

In this paper we explore challenges related to the engineering of plan libraries for plan recognition. This is an often overlooked problem, yet essential in the design of any real world plan recognizers. We mainly discuss challenges related to the evaluation of equivalence between plan libraries. We explain why this is a potential source of ill-conceived plan libraries. We consider an existing ...

متن کامل

Towards the Automatic Acquisition of Plan Libraries

While most plan recognition systems make use of a plan library containing the set of available plan hypotheses , little eeort has been devoted to the question of how to create such a library. This problem is particularly diicult to deal with when only little domain knowledge is available|a common situation when e.g. developing a help system for an already existing software system. This paper de...

متن کامل

String Shuffling over a Gap between Parsing and Plan Recognition

We propose a new probabilistic plan recognition algorithm YR based on an extension of Tomita’s Generalized LR (GLR) parser for grammars enriched with the shuffle operator. YR significantly outperforms previous approaches based on topdown parsers, shows more consistent run times among similar libraries, and degrades more gracefully as plan library complexity increases. YR also lifts the restrict...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006